Efficient priority rules

نویسندگان

  • Lars Ehlers
  • Bettina Klaus
چکیده

We study the assignment of indivisible objects with quotas (universities, jobs, or offices) to a set of agents (students, job applicants, or professors). Each agent receives at most one object and monetary compensations are not possible. We characterize efficient priority rules by efficiency, strategy-proofness, and reallocation-consistency. Such a rule respects an acyclic priority structure and the allocations are determined using the deferred acceptance algorithm. JEL Classification: D63, D70

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times

In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...

متن کامل

M/G/c QUEUEING SYSTEMS WITH MULTIPLE CUSTOMER CLASSES: CHARACTERIZATION AND CONTROL OF ACHIEVABLE PERFORMANCE UNDER NONPREEMPTIVE PRIORITY RULES*

This paper considers an MIG/c queueing system serving a finite number (J) of distinct customer classes. Performance of the system, as measured by the vector of steady-state xpected waiting times of the customer classes (the performance vector), may be controlled by adopting an appropriate priority discipline. We show that the performance space, the set of performance vectors which are achievabl...

متن کامل

Consistent strategy-proof assignment by hierarchical exchange

We characterize the family of efficient, consistent, and strategy-proof rules in house allocation problems. These rules follow an endowment inheritance and trade procedure as in Pápai’s Hierarchical Exchange rules [Pápai, S., 2000. Strategy-proof assignment by hierarchical exchange, Econometrica 68, 1403-1433] and closely resemble Ergin’s Priority Rules [Ergin, H., 2002. Efficient resource allo...

متن کامل

On Maintaining Priorities in a Production Rule System

We present a priority system which is particularly suited for production rules coupled to databases. In this system, there are default priorities between all rules and overriding user-defined priorities between particular rules. Rule processing using this system is repeatable: for a given set of rules and priorities, the rules are considered for execution in the same order if the same set of tr...

متن کامل

Axioms for Deferred Acceptance

The deferred acceptance algorithm is often used to allocate indivisible objects when monetary transfers are not allowed. We provide two characterizations of agent-proposing deferred acceptance allocation rules. Two new axioms, individually rational monotonicity and weak Maskin monotonicity, are essential to our analysis. An allocation rule is the agent-proposing deferred acceptance rule for som...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 55  شماره 

صفحات  -

تاریخ انتشار 2006